Lower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs
نویسندگان
چکیده
منابع مشابه
Lower Bounds for Ramsey Numbers for Complete Bipartite and 3-Uniform Tripartite Subgraphs
Let R(Ka,b, Kc,d) be the minimum number n so that any n-vertex simple undirected graph G contains a Ka,b or its complement G′ contains a Kc,d. We demonstrate constructions showing that R(K2,b, K2,d) > b + d + 1 for d ≥ b ≥ 2. We establish lower bounds for R(Ka,b, Ka,b) and R(Ka,b, Kc,d) using probabilistic methods. We define R′(a, b, c) to be the minimum number n such that any n-vertex 3-unifor...
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملAsymptotic Bounds for Bipartite Ramsey Numbers
The bipartite Ramsey number b(m,n) is the smallest positive integer r such that every (red, green) coloring of the edges of Kr,r contains either a red Km,m or a green Kn,n. We obtain asymptotic bounds for b(m, n) for m ≥ 2 fixed and n →∞.
متن کاملSome Ramsey numbers for complete bipartite graphs
Upper bounds are determined for the Ramsey number ](m,n), 2 :; m n. These bounds are attained for infinitely many n in case of m 3 and are fairly close to the exact value for every m if n is sufficiently large.
متن کاملNew lower bounds for hypergraph Ramsey numbers
The Ramsey number rk(s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1, . . . , N}, there are s integers such that every k-tuple among them is red, or n integers such that every k-tuple among them is blue. We prove the following new lower bounds for 4-uniform hypergraph Ramsey numbers: r4(5, n) > 2 n log n and r4(6, n) > 2 2 1/5 , where c is an absolute positive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2013
ISSN: 1526-1719
DOI: 10.7155/jgaa.00311